Data structures

Results: 1048



#Item
311

VACID-0: Verification of Ample Correctness of Invariants of Data-structures, Edition 0 K. Rustan M. Leino and Michał Moskal Microsoft Research, Redmond, WA, USA {leino,micmo}@microsoft.com

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2010-07-21 13:15:26
    312

    Z-Way API Version Dec 2012 Z-Way uses HTTP API to communicate with User Interfaces (UI) or external programs. Using Z-Way API one can access data structures in Z-Way and execute per devices and you can handle network man

    Add to Reading List

    Source URL: razberry.z-wave.me

    Language: English - Date: 2013-08-18 13:41:07
      313

      RICE UNIVERSITY Efficient Tamper-Evident Data Structures for Untrusted Servers by Scott Alexander Crosby

      Add to Reading List

      Source URL: tamperevident.cs.rice.edu

      Language: English - Date: 2010-12-28 02:19:06
        314

        Linked Structures •Self-referential classes can be used to create linked data structures: class Node: def __int__(self, data, next): self.data = data self.next = next

        Add to Reading List

        Source URL: web.cs.swarthmore.edu

        Language: English
          315

          Introduction An Introduction to Algorithms and Data Structures Overview

          Add to Reading List

          Source URL: staff.cs.manchester.ac.uk

          Language: English - Date: 2013-03-14 09:07:04
            316Arrays / Data structures / Linear algebra / Data analysis / Business intelligence / SAS / Contingency table / Array data structure / Array data type / Computing / Algebra / Computer programming

            R Multidimensional arrays in SAS/IML Software Michael Friendly York University

            Add to Reading List

            Source URL: www.datavis.ca

            Language: English - Date: 2012-09-12 11:48:20
            317Graph theory / Data management / Computing / R-tree / Persistent data structure / FO / B+ tree / Tango tree / B-tree / Binary trees / Data structures

            I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University We present an external planar point location data structure that is I/O-eff

            Add to Reading List

            Source URL: www.cs.swarthmore.edu

            Language: English - Date: 2004-01-23 10:39:23
            318

            Tregex and Tsurgeon: tools for querying and manipulating tree data structures Roger Levy∗ and Galen Andrew† ∗ School of Informatics University of Edinburgh

            Add to Reading List

            Source URL: nlp.stanford.edu

            Language: English - Date: 2007-09-26 00:39:01
              319Mathematical software / Sage / Bit array / Tree traversal / Python / Cython / AN/FSQ-7 / Binary tree / Set / Computing / Software engineering / Computer programming

              Sage Reference Manual: Data Structures Release 6.7 The Sage Development Team

              Add to Reading List

              Source URL: doc.sagemath.org

              Language: English - Date: 2015-06-24 05:21:38
              320

              The java.util.concurrent package aims to do for concurrency what java.util.Collections did for data structures. It makes Some problems go away Some problems trivial to solve by everyone Some problems easier to solve by c

              Add to Reading List

              Source URL: g.oswego.edu

              Language: English - Date: 2003-07-14 19:43:09
                UPDATE